Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
نویسندگان
چکیده
We present a new animation and model checking tool for CSP. The tool covers the CSP-M language, as supported by existing tools such as fdr and probe. Compared to those tools, it provides visual feedback in the source code, has an LTL model checker and can be used for combined CSP ‖ B specifications. During the development of the tool some intricate issues were uncovered with the CSP-M language. We discuss those issues, and provide suggestions for improvement. We also explain how we have ensured conformance with fdr, by using fdr itself to validate our tool’s output. We also provide empirical evidence on the performance of our tool compared to fdr, showing that it can be used on industrial-strength specifications.
منابع مشابه
Parsing and Validation of full CSP-M Specifications using Haskell and Prolog (Abstract)
CSP is a process algebra defined by Hoare. The first semantics associated with CSP was a denotational semantics in terms of traces, failures and divergences. Later an operational semantics was added [7]. CSP has been applied in many applications, notably for security protocols [6]. The most widely used tools today are fdr [2] and ProBE [3]. These tools use a syntax called machine readable CSP (...
متن کاملDesign and Use of CSP Meta-Model for Embedded Control Software Development
Software that is used to control machines and robots must be predictable and reliable. Model-Driven Design (MDD) techniques are used to comply with both the technical and business needs. This paper introduces a CSP meta-model that is suitable for these MDD techniques. The meta-model describes the structure of CSP models that are designed; using this meta-model it is possible to use all regular ...
متن کاملCSP-OZ-DC: A Combination of Specification Techniques for Processes, Data and Time
CSP-OZ-DC is a new combination of three well researched formal techniques for the specification of processes, data and time: CSP [Hoare 1985], Object-Z [Smith 2000], and Duration Calculus [Zhou et al. 1991]. This combination is illustrated by specifying the train controller of a case study on radio controlled railway crossings. The technical contribution of the paper is a smooth integration of ...
متن کاملVerifying End-to-End Protocols using Induction with CSP/FDR
We investigate a technique, suitable for process algebraic, nite-state machine (model-checking) automated tools, for formally modelling arbitrary network topologies. We model aspects of a protocol for multiservice networks, and demonstrate how the technique can be used to verify end-to-end properties of protocols designed for arbitrary numbers of intermediate nodes. Our models are presented in ...
متن کاملHow to Make FDR Spin LTL Model Checking of CSP by Refinement
We study the possibility of doing LTL model checking on CSP specifications in the context of refinement. We present evidence that the refinement-based approach to verification does not seem to be very well suited for verifying certain temporal properties. To remedy this problem, we show how to (and how not to) perform LTL model checking of CSP processes using refinement checking in general and ...
متن کامل